/*#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
    vector<string> xwang(n);
    vector<string> ywang(m);
     set<string> xSet;
     set<string> common;
    for(int i=0;i<n;i++)
    {
        cin>>xwang[i];
        xSet.insert(xwang[i]);
    }
    for(int i=0;i<m;i++)
    {
        cin>>ywang[i];
        if(xSet.find(ywang[i])!=xSet.end())
        {
            common.insert(ywang[i]);
        }
    }
    if(common.empty())
    {
        cout<<"sad!"<<endl;
    }
    else
    for(const string& place : common)
    {
        cout<<place<<endl;
    }

    }
    return 0;

}*/
/*
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <unordered_set>
using namespace std;

int main()
{
    int n;
    cin >>n;
    unordered_set<int> brr;
    vector<int> arr(n);
    vector<int> unique;
    for(int i=0;i<n;i++)
    {
        cin >> arr[i];
        if(brr.find(arr[i])==brr.end())
        {
            unique.push_back(arr[i]);
        }
    }
    cout<<unique.size()<<endl;
    for(int c: unique)
    {
        cout << c <<' ';
    }
    cout <<endl;

    return 0;
}*/
/*#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_set>
using namespace std;
int main()
{
    int n;
    cin >>n;
    while(n--)
    {
        int m;
        cin >> m;
        vector<int> brr(m);
        unordered_set<int> a;
        vector<int> b;
        for(int i=0;i<m;i++)
        {
            cin>>brr[i];
            if(a.find(brr[i])==a.end())
            {
                 a.insert(brr[i]);
                 b.push_back(brr[i]);
            }
        }
        for(int c : b)
        {
            cout<<c<<' ';
        }
        cout<<endl;
    }
    return 0;
}*/
